#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n,arr[100005];
queue<int> apple;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n;++i){scanf("%d",arr+i);}
    sort(arr+1,arr+1+n);
    for (int i=1;i<=n;++i){
        if (apple.empty()){apple.push(arr[i]);continue;}
        if (arr[i]<=apple.front()){apple.push(arr[i]);continue;}
        apple.pop();apple.push(arr[i]);
    }
    printf("%lu",apple.size());
    return 0;
}
